A Multi Objective Approach to solve Capacitated Vehicle Routing Problems with Time Windows Using Mixed Integer Linear Programming

نویسندگان

  • José Carlos Sousa
  • Haider Ali Biswas
  • Rui Brito
  • Alexandre Silveira
چکیده

This paper presents a multi objective approach to solve a Capacitated Vehicle Routing Problem with Time Windows (CVRPTW). The proposed model was implemented and tested in a real life problem of a distribution company “Just in Time Delivery S.A” in Portugal. In this paper we have considered an objective function with two main goals: the first is to minimize the total number of vehicles used in the distribution of the commodities to the several clients and the second is to minimize the travelling time of the used vehicles. The proposed model has been solved numerically using the GLPK software and the optimal solution is presented.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Comparing Two-Echelon and Single-Echelon Multi-Objective Capacitated Vehicle Routing Problems

This paper aims to compare a two-echelon and a single-echelon distribution system. A mathematical model for the Single-Echelon Capacitated Vehicle Routing Problem (SE-CVRP) is proposed. This SE-CVRP is the counterpart of Two-Echelon Capacitated Vehicle Routing Problem (2E-CVRP) introduced in the authors’ previous work. The proposed mathematical model is Mixed-Integer Non-Linear Programming (MIN...

متن کامل

A multi-objective Two-Echelon Capacitated Vehicle Routing Problem for perishable products

This article addresses a general tri-objective two-echelon capacitated vehicle routing problem (2E-CVRP) to minimize the total travel cost, customers waiting times and carbon dioxide emissions simultaneously in distributing perishable products. In distributing perishable products, customers’ satisfaction is very important and is inversely proportional to the customers waiting times. The propose...

متن کامل

An Improved Particle Swarm Optimization for a Class of Capacitated Vehicle Routing Problems

Vehicle Routing Problem (VRP) is addressed to a class of problems for determining a set of vehicle routes, in which each vehicle departs from a given depot, serves a given set of customers, and returns back to the same depot. On the other hand, simultaneous delivery and pickup problems have drawn much attention in the past few years due to its high usage in real world cases. This study, therefo...

متن کامل

The Bi-Objective Location-Routing Problem based on Simultaneous Pickup and Delivery with Soft Time Window

The location-routing problem is the most significant and yet new research field in location problems that considers simultaneously vehicle routing problem features with original one for achieving high-quality integrated distribution systems in beside of the global optimum. Simultaneous pickup and delivery based on time windows are the two main characteristics of logistic management that have be...

متن کامل

A goal programming model for vehicle routing problem with backhauls and soft time windows

The vehicle routing problem with backhauls (VRPB) as an extension of the classical vehicle routing prob-lem (VRP) attempts to define a set of routes which services both linehaul customers whom product are to be delivered and backhaul customers whom goods need to be collected. A primary objective for the problem usually is minimizing the total distribution cost. Most real-life problems have othe...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2011